Synchronous Kleene algebra
نویسندگان
چکیده
منابع مشابه
Synchronous Kleene Algebra vs. Concurrent Kleene Algebra
In this year’s CONCUR conference Concurrent Kleene Algebra (CKA) is presented as a general formalism for reasoning about concurrent programs. Also recently Synchronous Kleene Algebra (SKA) was investigated by this author with the purpose of representing and reasoning about actions/programs that have a notion of concurrency in the style of synchrony of the SCCS calculus. CKA has, at first sight,...
متن کاملDeciding Synchronous Kleene Algebra with Derivatives
Synchronous Kleene algebra (SKA) is a decidable framework that combines Kleene algebra (KA) with a synchrony model of concurrency. Elements of SKA can be seen as processes taking place within a fixed discrete time frame and that, at each time step, may execute one or more basic actions or then come to a halt. The synchronous Kleene algebra with tests (SKAT) combines SKA with a Boolean algebra. ...
متن کاملKleene Algebra
3 Dioids 4 3.1 Join Semilattices . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.2 Join Semilattices with an Additive Unit . . . . . . . . . . . . 5 3.3 Near Semirings . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.4 Variants of Dioids . . . . . . . . . . . . . . . . . . . . . . . . 6 3.5 Families of Nearsemirings with a Multiplicative Unit . . . . . 8 3.6 Families of Nearsemirin...
متن کاملKleene Algebra Modulo Theories
Kleene algebras with tests (KATs) o er sound, complete, and decidable equational reasoning about regularly structured programs. Since NetKAT demonstrated how well various extensions of KATs apply to computer networks, interest in KATs has increased greatly. Unfortunately, extending a KAT to a particular domain by adding custom primitives, proving its equational theory sound and complete, and co...
متن کاملKleene Algebra Completeness
This paper gives a new presentation of Kozen’s proof of Kleene algebra completeness featured in his article A completeness theorem for Kleene algebras and the algebra of regular events. A few new variants are introduced, shortening the proof. Specifically, we directly construct an ε-free automaton to prove an equivalent to Kleene’s representation theorem (implementing Glushkov’s instead of Thom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2010
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2010.07.009